L'ANALYSE HYBRIDE APPLIQUEE AU CALCUL DU REGIME CONTINU DES CIRCUITS NON LINEAIRERASLAN NABIL AHMED.1980; ; FRA; DA. 1980; 162 P.; 30 CM; BIBL. 47 REF.; TH. DOCT.-ING./TOULOUSE 3/1980/720Thesis

ALGORITHMISCHE KOMBINATORIK AUF DER STUFE PROGRAMMIERBARER TASCHEN-RECHNER = ALGORITHME COMBINATOIRE POUR CALCULATEUR DE POCHE PROGRAMMABLEJEGER M.1979; Z. ANGEW. MATH. PHYS.; CHE; DA. 1979; VOL. 30; NO 2; PP. 243-260; ABS. ENG; BIBL. 7 REF.Article

ANALYSIS OF COMBINATORY ALGORITHMS. A SAMPLE OF CURRENT METHODOLOGYFRAZER WD.1972; IN: AM. FED. INF. PROCESS. SOC. SPRING JT COMPUT. CONF. ATLANTIC CITY, N.J. 1972. PROC.; MONTVALE, N.J.; AFIPS; DA. 1972; PP. 483-491; BIBL. 19 REF.Conference Proceedings

SYNTHESIZING CONSTRAINST EXPRESSIONSFREUDER EC.1978; COMMUNIC. A.C.M.; USA; DA. 1978; VOL. 21; NO 11; PP. 958-966; BIBL. 24 REF.Article

Strong qualitative independenceKATONA, Gvula O. H.Discrete applied mathematics. 2004, Vol 137, Num 1, pp 87-95, issn 0166-218X, 9 p.Conference Paper

Some recent results in heuristic search theoryPEARL, J.IEEE transactions on pattern analysis and machine intelligence. 1984, Vol 6, Num 1, pp 1-13, issn 0162-8828Article

Discrete mathematics and theoretical computer science (DMTCS)CHEN, Jianer; LIU, Yanpei; CHEN, Suowang et al.Discrete applied mathematics. 2004, Vol 136, Num 1, issn 0166-218X, 160 p.Serial Issue

The 2001 International Workshop on Combinatorial Image Analysis (IWCIA 2001)FOUREY, Sébastien; HERMAN, Gabor T; KONG, T. Yung et al.Discrete applied mathematics. 2004, Vol 139, Num 1-3, issn 0166-218X, 308 p.Conference Proceedings

Brazilian Symposium on Graphs, Algorithms and CombinatoricsREED, Bruce A; SONG, Siang W; SZWARCFITER, Jayme L et al.Discrete applied mathematics. 2004, Vol 141, Num 1-3, issn 0166-218X, 297 p.Conference Proceedings

1st International Workshop on Combinatorics of Searching, Sorting, and Coding (COSSAC '01), September 7-9, 2001, Ischia, ItalyCICALESE, Ferdinando; MUNDICI, Daniele; VACCARO, Ugo et al.Discrete applied mathematics. 2004, Vol 137, Num 1, issn 0166-218X, 124 p.Conference Proceedings

1st International Workshop on Algorithms, Combinatorics, and Optimization in Interconnection Networks (IWACOIN '99), August 1999, Schwerin, GermanyLABAHN, Roger; LIESTMAN, Arthur L; PRISNER, Erich et al.Discrete applied mathematics. 2004, Vol 137, Num 2, issn 0166-218X, 113 p.Conference Proceedings

On the span of supersymmetric Young tableauxROTA, G.-C; STEIN, J. A.Proceedings of the National Academy of Sciences of the United States of America. 1993, Vol 90, Num 2, pp 700-701, issn 0027-8424Article

Packing non-returning A-paths algorithmicallyPAP, Gyula.Discrete mathematics. 2008, Vol 308, Num 8, pp 1472-1488, issn 0012-365X, 17 p.Conference Paper

(2 + f(n))-SAT and its propertiesYUNLEI ZHAO; XIAOTIE DENG; LEE, C. H et al.Discrete applied mathematics. 2004, Vol 136, Num 1, pp 3-11, issn 0166-218X, 9 p.Article

Families of integral trees with diameters 4, 6, and 8LIGONG WANG; XUELIANG LI; SHENGGUI ZHANG et al.Discrete applied mathematics. 2004, Vol 136, Num 2-3, pp 349-362, issn 0166-218X, 14 p.Conference Paper

Super-simple (v, 5,2)-designsGRONAU, Hans-Dietrich O. F; KREHER, Donald L; LING, Alan C. H et al.Discrete applied mathematics. 2004, Vol 138, Num 1-2, pp 65-77, issn 0166-218X, 13 p.Conference Paper

Variants of the majority problemAIGNER, Martin.Discrete applied mathematics. 2004, Vol 137, Num 1, pp 3-25, issn 0166-218X, 23 p.Conference Paper

Making a tournament k-arc-strong by reversing or deorienting arcsBANG-JENSEN, Jorgen; YEO, Anders.Discrete applied mathematics. 2004, Vol 136, Num 2-3, pp 161-171, issn 0166-218X, 11 p.Conference Paper

Completing partial latin squares with prescribed diagonalsGRÜTTMÜLLER, Martin.Discrete applied mathematics. 2004, Vol 138, Num 1-2, pp 89-97, issn 0166-218X, 9 p.Conference Paper

Fractional packing of T-joinsBARAHONA, Francisco.SIAM journal on discrete mathematics (Print). 2004, Vol 17, Num 4, pp 661-669, issn 0895-4801, 9 p.Article

Gray code for derangementsBARIL, Jean-Luc; VAJNOVSZKI, Vincent.Discrete applied mathematics. 2004, Vol 140, Num 1-3, pp 207-221, issn 0166-218X, 15 p.Article

On spaced seeds for similarity searchKEICH, Uri; MING LI; BIN MA et al.Discrete applied mathematics. 2004, Vol 138, Num 3, pp 253-263, issn 0166-218X, 11 p.Article

Boolean and Pseudo-Boolean FunctionsHAMMER, Peter L.Discrete applied mathematics. 2004, Vol 142, Num 1-3, issn 0166-218X, 210 p.Serial Issue

Recognizing quasi-triangulated graphsSPINRAD, Jeremy P.Discrete applied mathematics. 2004, Vol 138, Num 1-2, pp 203-213, issn 0166-218X, 11 p.Conference Paper

Improved combinatorial group testing algorithms for real-world problem suzesEPPSTEIN, David; GOODRICH, Michael T; HIRSCHBERG, Daniel S et al.SIAM journal on computing (Print). 2007, Vol 36, Num 5, pp 1360-1375, issn 0097-5397, 16 p.Article